Analysis of Simple Algorithms for Dynamic Load Balancing
نویسندگان
چکیده
The principle of load balancing is examined for dynamic resource allocation subject to certain constraints The emphasis is on the performance of simple allocation strategies which can be implemented on line Either nite capacity constraints on resources or migration of load can be incorporated into the setup The load balancing problem is formulated as a stochastic optimal control problem Variants of a Least Load Routing policy are shown to lead to a uid type limit and to be asymptotically optimal
منابع مشابه
A detailed analysis of random polling dynamic load balancing
Dynamic load balancing is crucial for the performance of many parallel algorithms. Random Polling, a simple randomized load balancing algorithm, has proved to be very eecient in practice for applications like parallel depth rst search. This paper presents a detailed analysis of the algorithm taking into account many aspects of the underlying machine and the application to be load balanced. It d...
متن کاملAnalysis of Random Polling Dynamic Load Balancing
Dynamic load balancing is crucial for the performance of many parallel algorithms. Random Polling, a simple randomized algorithm, has proved to be very eecient in practice for applications like parallel depth rst search. This paper derives tight bounds for the scalability of Random Polling which are for the rst time able to explain its superior performance analytically. In some cases, Random Po...
متن کاملLoad Balancing Approaches for Web Servers: A Survey of Recent Trends
Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...
متن کاملPerformance Analysis of Load Balancing Algorithms
Load balancing is the process of improving the performance of a parallel and distributed system through a redistribution of load among the processors [1] [5]. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic bot...
متن کاملDynamic versus Static Load Balancing in a Pipeline Computation
We examine load balancing in a simple pipeline computation, in which a large number of data sets is pipelined through a series of tasks and load balancing is performed by distributing several available processors among the tasks. We compare the performance of the optimal static processor assignment to the performances of three dynamic processor assignment algorithms. Models are derived which al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 22 شماره
صفحات -
تاریخ انتشار 1997